#include<bits/stdc++.h>

using namespace std;
int n,x;
map<int,int> a;
set<int> s;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x;
        if(a.find(x)==a.end())
        {
            a.insert({x,1});s.insert(x);
        }
        else a[x]++;
    }
    x=0;
    for(int i:s) x=max(x,a[i]);
    cout<<x<<endl;
    return 0;
}
